On Tractable Parameterizations of Graph Isomorphism
نویسندگان
چکیده
The fixed-parameter tractability of graph isomorphism is an open problem with respect to a number of natural parameters, such as tree-width, genus and maximum degree. We show that graph isomorphism is fixed-parameter tractable when parameterized by the tree-depth of the graph. We also extend this result to a parameter generalizing both tree-depth and max-leaf-number by deploying new variants of cops-androbbers games.
منابع مشابه
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NP-hard problems. MCIS remains NP-hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is known, however, about the parameterized complexity of the problem. When parameterized by the vertex cover number of the input graphs, the problem was recently shown to be fixed-paramete...
متن کاملGraph isomorphism parameterized by feedback vertex set number is fixed-parameter tractable
We prove that the Graph Isomorphism problem is fixed-parameter tractable when parameterized by the feedback vertex set number. That parameter is defined as the number of vertex deletions required to obtain a forest. For graphs of bounded feedback vertex set number the presented algorithm runs in time O(n), and is thereby the first fixed-parameter tractable Graph Isomorphism algorithm for a non-...
متن کاملEdge-Editing to a Dense and a Sparse Graph Class
We consider a graph edge-editing problem, where the goal is to transform a given graph G into a disjoint union of two graphs from a pair of given graph classes, investigating what properties of the classes make the problem fixed-parameter tractable. We focus on the case when the first class is dense, i.e. every such graph G has minimum degree at least |V (G)| − δ for a constant δ, and assume th...
متن کاملGraph Isomorphism for Bounded Genus Graphs In Linear Time
For every integer g, isomorphism of graphs of Euler genus at most g can be decided in linear time. This improves previously known algorithms whose time complexity is nO(g) (shown in early 1980’s), and in fact, this is the first fixed-parameter tractable algorithm for the graph isomorphism problem for bounded genus graphs in terms of the Euler genus g. Our result also generalizes the seminal res...
متن کاملOn Fixed-Parameter Tractable Parameterizations of SAT
We survey and compare parameterizations of the propositional satisfiability problem (SAT) in the framework of Parameterized Complexity (Downey and Fellows, 1999). In particular, we consider (a) parameters based on structural graph decompositions (tree-width, branch-width, and clique-width), (b) a parameter emerging from matching theory (maximum deficiency), and (c) a parameter defined by transl...
متن کامل